Multiway range trees: scalable IP lookup with fast updates
نویسندگان
چکیده
منابع مشابه
Multiway range trees: scalable IP lookup with fast updates
Internet routers forward packets based on the destination address of a packet. A packet's address is matched against the destination prefixes stored in the router's forwarding table, and the packet is sent to the output interface determined by the longest matching prefix. While some existing schemes work well for IPv4 addresses, we believe that none of the current schemes scales well to IPv6, e...
متن کاملIP Lookup Using the Novel Idea of Scalar Prefix Search with Fast Table Updates
Recently, we have proposed a new prefix lookup algorithm which would use the prefixes as scalar numbers. This algorithm could be applied to different tree structures such as Binary Search Tree and some other balanced trees like RB-tree, AVL-tree and B-tree with minor modifications in the search, insert and/or delete procedures to make them capable of finding the prefixes of an incoming string e...
متن کاملScalable IP Lookup for Programmable Routers
Continuing growth in optical link speeds places increasing demands on the performance of Internet routers, while deployment of embedded and distributed network services imposes new demands for flexibility and programmability. IP address lookup has become a significant performance bottleneck for the highest performance routers. Amid the vast array of academic and commercial solutions to the prob...
متن کاملScalable IP lookup for Internet routers
Internet protocol (IP) address lookup is a central processing function of Internet routers. While a wide range of solutions to this problem have been devised, very few simultaneously achieve high lookup rates, good update performance, high memory efficiency, and low hardware cost. High performance solutions using content addressable memory devices are a popular but high-cost solution, particula...
متن کاملFlexible and fast IP lookup algorithm
| In this paper, we introduce a fast IP table lookup algorithm that improves table updating time as well as IP address searching time. Because routers with Patricia trie can't support giga-bit performance, many algorithms to support giga-bit routing performance by reducing serching time have been introduced. Most of them, however, did not considerably count the importance of updating time. As a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Networks
سال: 2004
ISSN: 1389-1286
DOI: 10.1016/j.comnet.2003.09.004